Tham khảo Tô_màu_đồ

Tham khảo Tô_màu_đồ_thị

Barenboim, L.; Elkin, M. (2009), “Distributed (Δ + 1)-coloring in linear (in Δ) time”, Proceedings of the 41st Symposium on Theory of Computing, tr. 111–120, ISBN 978-1-60558-506-2, doi:10.1145/1536414.1536432

Panconesi, A.; Srinivasan, A. (1996), “On the complexity of distributed network decomposition”, Journal of Algorithms 20

Schneider, J. (2010), “A new technique for distributed symmetry breaking”, Proceedings of the [[Symposium on Principles of Distributed Computing]] (PDF) Tựa đề URL chứa liên kết wiki (trợ giúp)
Schneider, J. (2008), “A log-star distributed maximal independent set algorithm for growth-bounded graphs”, Proceedings of the [[Symposium on Principles of Distributed Computing]] (PDF) Tựa đề URL chứa liên kết wiki (trợ giúp)

Beigel, R.; Eppstein, D. (2005), “3-coloring in time O(1.3289n)”, Journal of Algorithms 54 (2)): 168–204, doi:10.1016/j.jalgor.2004.06.008
Björklund, A.; Husfeldt, T.; Koivisto, M. (2009), “Set partitioning via inclusion–exclusion”, SIAM Journal on Computing 39 (2): 546–563, doi:10.1137/070683933
Brèlaz, D. (1979), “New methods to color the vertices of a graph”, Communications of the ACM 22 (4): 251–256, doi:10.1145/359094.359101
Brooks, R. L.; Tutte, W. T. (1941), “On colouring the nodes of a network”, Proceedings of the Cambridge Philosophical Society 37 (2): 194–197, doi:10.1017/S030500410002168X
de Bruijn, N. G.; Erdős, P. (1951), “A colour problem for infinite graphs and a problem in the theory of relations” (PDF), Nederl. Akad. Wetensch. Proc. Ser. A 54: 371–373 (= Indag. Math. 13)
Byskov, J.M. (2004), “Enumerating maximal independent sets with applications to graph colouring”, Operations Research Letters 32 (6): 547–556, doi:10.1016/j.orl.2004.03.002

Chaitin, G. J. (1982), “Register allocation & spilling via graph colouring”, Proc. 1982 SIGPLAN Symposium on Compiler Construction, tr. 98–105, ISBN 0-89791-074-5, doi:10.1145/800230.806984
Cole, R.; Vishkin, U. (1986), “Deterministic coin tossing with applications to optimal parallel list ranking”, Information and Control 70 (1): 32–53, doi:10.1016/S0019-9958(86)80023-7
Cormen, T. H.; Leiserson, C. E.; Rivest, R. L. (1990), Introduction to Algorithms (ấn bản 1), The MIT Press
Dailey, D. P. (1980), “Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete”, Discrete Mathematics 30 (3): 289–293, doi:10.1016/0012-365X(80)90236-8
Duffy, K.; O'Connell, N.; Sapozhnikov, A. (2008), “Complexity analysis of a decentralised graph colouring algorithm” (PDF), Information Processing Letters 107 (2): 60–63, doi:10.1016/j.ipl.2008.01.002
Fawcett, B. W. (1978), “On infinite full colourings of graphs”, Can. J. Math. XXX: 455–457
Garey, M. R.; Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, ISBN 0-7167-1045-5
Garey, M. R.; Johnson, D. S.; Stockmeyer, L. (1974), “Some simplified NP-complete problems”, Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, tr. 47–63, doi:10.1145/800119.803884
Goldberg, L. A.; Jerrum, M. (tháng 7 năm 2008), “Inapproximability of the Tutte polynomial”, Information and Computation 206 (7): 908–929, doi:10.1016/j.ic.2008.04.003
Goldberg, A. V.; Plotkin, S. A.; Shannon, G. E. (1988), “Parallel symmetry-breaking in sparse graphs”, SIAM Journal on Discrete Mathematics 1 (4): 434–446, doi:10.1137/0401044
Guruswami, V.; Khanna, S. (2000), “On the hardness of 4-coloring a 3-colorable graph”, Proceedings of the 15th Annual IEEE Conference on Computational Complexity, tr. 188–197, ISBN 0-7695-0674-7, doi:10.1109/CCC.2000.856749
Halldórsson, M. M. (1993), “A still better performance guarantee for approximate graph coloring”, Information Processing Letters 45: 19–23, doi:10.1016/0020-0190(93)90246-6
Holyer, I. (1981), “The NP-completeness of edge-coloring”, SIAM Journal on Computing 10 (4): 718–720, doi:10.1137/0210055
Crescenzi, P.; Kann, V. (tháng 12 năm 1998), “How to find the best approximation results — a follow-up to Garey and Johnson”, ACM SIGACT News 29 (4): 90, doi:10.1145/306198.306210
Jaeger, F.; Vertigan, D. L.; Welsh, D. J. A. (1990), “On the computational complexity of the Jones and Tutte polynomials”, Mathematical Proceedings of the Cambridge Philosophical Society 108: 35–53, doi:10.1017/S0305004100068936
Jensen, T. R.; Toft, B. (1995), Graph Coloring Problems, Wiley-Interscience, New York, ISBN 0-471-02865-7
Khot, S. (2001), “Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring”, Proc. 42nd Annual Symposium on Foundations of Computer Science, tr. 600–609, ISBN 0-7695-1116-3, doi:10.1109/SFCS.2001.959936
Kubale, M. (2004), Graph Colorings, American Mathematical Society, ISBN 0-8218-3458-4
Kuhn, F. (2009), “Weak graph colorings: distributed algorithms and applications”, Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, tr. 138–144, ISBN 978-1-60558-606-9, doi:10.1145/1583991.1584032
Lawler, E.L. (1976), “A note on the complexity of the chromatic number problem”, Information Processing Letters 5 (3): 66–67, doi:10.1016/0020-0190(76)90065-X

Leith, D.J.; Clifford, P. (2006), “A Self-Managed Distributed Channel Selection Algorithm for WLAN”, Proc. RAWNET 2006, Boston, MA (PDF)
Linial, N. (1992), “Locality in distributed graph algorithms”, SIAM Journal on Computing 21 (1): 193–201, doi:10.1137/0221015
van Lint, J. H.; Wilson, R. M. (2001), A Course in Combinatorics (ấn bản 2), Cambridge University Press, ISBN 0-521-80340-3. Kiểm tra giá trị |isbn= (trợ giúp)
Marx, Dániel (2004), “Graph colouring problems and their applications in scheduling”, Periodica Polytechnica, Electrical Engineering 48 (1–2), tr. 11–16, CiteSeerX: 10.1.1.95.4268
Mycielski, J. (1955), “Sur le coloriage des graphes” (PDF), Colloq. Math. 3: 161–162 .
Panconesi, Alessandro; Rizzi, Romeo (2001), “Some simple distributed algorithms for sparse networks”, Distributed Computing (Berlin, New York: Springer-Verlag) 14 (2): 97–100, ISSN 0178-2770, doi:10.1007/PL00008932
Sekine, K.; Imai, H.; Tani, S. (1995), “Computing the Tutte polynomial of a graph of moderate size”, Proc. 6th International Symposium on Algorithms and Computation (ISAAC 1995), Lecture Notes in Computer Science 1004, Springer, tr. 224–233, ISBN 3-540-60573-8, doi:10.1007/BFb0015427
Welsh, D. J. A.; Powell, M. B. (1967), “An upper bound for the chromatic number of a graph and its application to timetabling problems”, The Computer Journal 10 (1): 85–86, doi:10.1093/comjnl/10.1.85
West, D. B. (1996), Introduction to Graph Theory, Prentice-Hall, ISBN 0-13-227828-6
Wilf, H. S. (1986), Algorithms and Complexity, Prentice–Hall
Zuckerman, D. (2007), “Linear degree extractors and the inapproximability of Max Clique and Chromatic Number”, Theory of Computing 3: 103–128, doi:10.4086/toc.2007.v003a006
Zykov, A. A. (1949), “О некоторых свойствах линейных комплексов (On some properties of linear complexes)”, Math. Sbornik. (bằng tiếng Nga), 24(66) (2): 163–188
Jensen, Tommy R.; Toft, Bjarne (1995), Graph Coloring Problems, John Wiley & Sons, ISBN 0-471-02865-7, 9780471028659 Kiểm tra giá trị |isbn= (trợ giúp)